Linear-time CUR approximation of BEM matrices
نویسندگان
چکیده
منابع مشابه
Block CUR : Decomposing Large Distributed Matrices
A common problem in large-scale data analysis is to approximate a matrix using a combination of specifically sampled rows and columns, known as CUR decomposition. Unfortunately, in many real-world environments, the ability to sample specific individual rows or columns of the matrix is limited by either system constraints or cost. In this paper, we consider matrix approximation by sampling prede...
متن کاملOn the Approximation of Pseudo Linear Systems by Linear Time Varying Systems (RESEARCH NOTE)
This paper presents a modified method for approximating nonlinear systems by a sequence of linear time varying systems. The convergence proof is outlined and the potential of this methodology is discussed. Simulation results are used to show the effectiveness of the proposed method.
متن کاملCUR Algorithm for Partially Observed Matrices
CUR matrix decomposition computes the low rank approximation of a given matrix by using the actual rows and columns of the matrix. It has been a very useful tool for handling large matrices. One limitation with the existing algorithms for CURmatrix decomposition is that they cannot deal with entries in a partially observed matrix, while incomplete matrices are found in many real world applicati...
متن کاملCUR Decompositions, Similarity Matrices, and Subspace Clustering
A general framework for solving the subspace clustering problem using the CUR decomposition is presented. The CUR decomposition provides a natural way to construct similarity matrices for data that come from a union of unknown subspaces U = M ⋃ i=1 Si. The similarity matrices thus constructed give the exact clustering in the noise-free case. A simple adaptation of the technique also allows clus...
متن کاملSystem Identification via CUR-factored Hankel Approximation
Subspace-based system identification for dynamical systems is a sound, system-theoretic way to obtain linear, time-invariant system models from data. The interplay of data and systems theory is reflected in the Hankel matrix, a block-structured matrix whose factorization is necessary for system identification. For systems with many inputs, many outputs, or large timeseries of system-response da...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2020
ISSN: 0377-0427
DOI: 10.1016/j.cam.2019.112528